Wirelength Estimation based on Rent Exponents of Partitioning and Placement 1
نویسندگان
چکیده
Wirelength estimation is one of the most important Rent’s rule applications. Traditionally, the Rent exponent is extracted using recursive bipartitioning. However, the obtained exponent may not be appropriate for the purpose of wirelength estimation. In this paper, we propose the concepts of partitioning-based Rent exponent and placement-based Rent exponent. The relationship between these two exponents is analyzed and empirically verified. Experiments on large industrial circuits show that for wirelength estimation, the Rent exponent extracted from placement is more appropriate than that from partitioning. 1This work was supported by NSF under Grant #CCR-0090203. A preliminary version of this paper appeared in Proc. Int. Workshop on System-Level Interconnect Prediction, pp.25-31, April 2001.
منابع مشابه
Relaxed Partitioning Balance Constraints in Top-Down Placement
Recent work of Simon and Teng [17] observes that the recursive bisection (i.e., bipartitioning with equal partition target areas, and minimum possible allowed deviation from targets) heuristic for kway minimum-cut graph partitioning can have unbounded error, but that relaxing the balance constraints in each call to the bipartitioning engine can result in k-way net cuts within a small (O(logk)) ...
متن کاملEstimation of Wirelength Reduction for λ-Geometry vs. Manhattan Placement and Routing∗
λ-geometry routing has recently received much attention due to the potential for reduced interconnect length in comparison to today’s prevalent Manhattan routing. An accurate cost-benefit analysis of λ-geometry routing is impossible without good estimation of the wirelength reduction expected when switching from Manhattan to λ-geometry routing. However, in the literature, estimates of wirelengt...
متن کاملT HETO — A Fast , Scalable and High - Quality Partitioning Driven Placement Tool
Partitioning driven placement approaches are often preferred for fast and scalable solutions to large placement problems. However, due to the inaccuracy of representing wirelength objective by cut objective the quality of such placements often trails the quality of placements produced by pure wirelength driven placements. In this paper we present THETO, a new partitioning driven placement algor...
متن کاملTHETO - A Fast and High-Quality Partitioning Driven Global Placer
Partitioning driven placement approaches are often preferred for fast and scalable solutions to large placement problems. However, due to the inaccuracy of representing wirelength objective by cut objective the quality of such placements often trails the quality of placements produced by pure wirelength driven placements. In this paper we present THETO, a new partitioning driven global placemen...
متن کاملOn Improving Recursive Bipartitioning-Based Placement
We present an improved partitioning-based placement tool in terms of the half-perimeter wirelength. In contrast to placement tools that exploit white spaces to reduce the routing congestion, our placement tool exploits white spaces to reduce the total wirelength. In particular, we generate white spaces during the legalization step and treat white spaces as pseudo cells during the detailed place...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001